FIRST-ORDER RECOGNIZABILITY IN FINITE AND PSEUDOFINITE GROUPS
نویسندگان
چکیده
منابع مشابه
First-Order Queries on Finite Abelian Groups
We study the computational problem of checking whether a logical sentence is true in a finite abelian group. We prove that model checking first-order sentences on finite abelian groups is fixed-parameter tractable, when parameterized by the size of the sentence. We also prove that model checking monadic second-order sentences on finite abelian groups finitely presented by integer matrices is no...
متن کاملGroups in supersimple and pseudofinite theories
We consider groups G interpretable in a supersimple finite rank theory T such that T eq eliminates ∃∞. It is shown that G has a definable soluble radical. If G has rank 2, then if G is pseudofinite it is soluble-by-finite, and partial results are obtained under weaker hypotheses, such as unimodularity of the theory. A classification is obtained when T is pseudofinite and G has a definable and d...
متن کاملPseudofinite groups with NIP theory and definability in finite simple groups
We show that any pseudofinite group with NIP theory and with a finite upper bound on the length of chains of centralisers is soluble-by-finite. In particular, any NIP rosy pseudofinite group is soluble-by-finite. This generalises, and shortens the proof of, an earlier result for stable pseudofinite groups. An example is given of an NIP pseudofinite group which is not soluble-by-finite. However,...
متن کاملStable pseudofinite groups
The main theorem is that if G is a pseudofinite group with stable theory, then G has a definable normal soluble subgroup of finite index.
متن کاملDescribing Finite Groups by Short First-order Sentences
We say that a class of finite structures for a finite signature is r-compressible if each structure G in the class has a first-order description of size at most O(r(|G|)). We show that the class of finite simple groups is log-compressible, and the class of all finite groups is log-compressible. The result relies on the classification of finite simple groups, the bi-interpretability of the small...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Symbolic Logic
سال: 2020
ISSN: 0022-4812,1943-5886
DOI: 10.1017/jsl.2020.14